Performance analysis of statistical multiplexing of heterogeneous discrete-time Markovian arrival processes in an ATM network
نویسندگان
چکیده
The cell loss probability and the mean cell delay are major performance metrics in analyzing a statistical multiplexer loaded with a superposition of independent and heterogeneous bursty sources. In this paper, we model each arrival process by a two-state discrete-time Markovian arrival process (D-MAP). We discuss that this traffic modeling is more realistic than the other ones in ATM networks. Then we model the superposition of r types of the two-state D-MAPS into a discrete-time batch Markovian arrival process (D-BMAP) with 2’ states. By using the steady-state analysis of the D-BMAPIDIlIKqueueing model, we obtain the exact cell loss probabilities and the mean cell delays for each type of traffic in the statistical multiplexer. In particular, we derive the formulas concerned with these performance metrics under two buffer access strategies of the simultaneous cell arrivals at the same slot: (1) fair access, and (2) priority access. From some numerical examples, we show that the performance of each traffic at the statistical multiplexer may be severely affected by its own traffic characteristics and priority of buffer access, as well as the traffic characteristics of the others.
منابع مشابه
Characterization and multiplexing of correlated traffic from sources with different time constants
Single server, discrete-time queueing systems under independent or Markov arrival processes and deterministic service requirements have been studied widely in the past. The xed service time is usually set equal to one deening the time unit of the discrete-time system axis. Such queueing systems have been adopted for the modeling of statistical multiplexers in slotted communication networks supp...
متن کاملCirculant matching method for multiplexing ATM traffic applied to video sources
In this paper a method is proposed called circulant matching method to approximate the superposition of a number of discrete time batch Markovian arrival sources by a circulant batch Markovian process while matching the stationary cumulative distribution and the autocorrelation sequence of the input rate process Special attention is paid to periodic sources The method is applied to the superpos...
متن کاملGeneral Discrete - Time Queueing Systems with Correlated Batch Arrivalsand
| Discrete time queueing systems have gained attention recently due to their applications in the performance analysis of ATM and other systems. In this paper, we analyze generic discrete-time queueing models with general distribution for batch arrivals and departures. Our models allow correlation and distributions with arbitrary rational probability generating functions. Our solution methodolog...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملQueueing of Correlated Packet-trains : an Analytic Performance Study
We study a statistical multiplexer that is modelled as a discrete-time single-server queueing system with infinite capacity. At the input of the multiplexer, there is a possibly unbounded population of users that generate ‘low-speed’ messages. Each such message is composed of a variable number of fixed-length packets which consecutively enter the queue at the speed of one packet per time slot. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 20 شماره
صفحات -
تاریخ انتشار 1997